Global register allocation during dynamic binary translation
نویسندگان
چکیده
منابع مشابه
Register Allocation for QEMU Dynamic Binary Translation Systems
Binary translation is an important step to solve the code migration, QEMU is more advanced and efficient binary translation system. It uses lighter TCG technology to achieve dynamic binary translation but analysis of the TCG internal process, we found that the excessive use of temporary variables meaningless in the TCG intermediate code, the backend generates host code does not take into accoun...
متن کاملRegister Liveness Analysis for Optimizing Dynamic Binary Translation
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only highly efficient optimization algorithms can be employed. Common problems are an insufficient number of registers on the target architecture and the different handling of condition codes in source and target architectu...
متن کاملDependence-Conscious Global Register Allocation
Register allocation and instruction scheduling are antagonistic optimizations: Whichever is applied rst, it will impede the other. To solve this problem, we propose dependence-conscious colouring, a register allocation method that takes the dependence graph used by the instruction schedu-ler into consideration. Dependence-conscious colouring consists of two parts: First, the interference graph ...
متن کاملLive Range Hole Allocation in Dynamic Binary Translation
Dynamic Binary Translation (DBT) has been used as an approach to transparently run code on different architectures and has generally made use of runtime information to perform effective dynamic compiler optimization. Dynamic optimization techniques are hard to design, as they have to improve code performance under stringent runtime constraints. In this paper we present preliminary work on a cod...
متن کاملRegister Allocation for Unary-Binary Trees
We study the number of registers required for evaluating arithmetic expressions formed with any set of unary and binary operators. Our approach consists in a singularity analysis of intervening generating functions combined with a use of (complex) Mellin inversion. We illustrate it first by rederiving the known results about binary trees and then extend it to the fully general case of unaj-bina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2016
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2016-28(5)-12